|
In computer science, more precisely in automata theory, a rational set of a monoid is an element of the minimal class of subsets of this monoid which contains all finite subsets and is closed under union, product and Kleene star. Rational sets are useful in automata theory, formal languages and algebra. A rational set generalizes the notion of rational (regular) language (understood as defined by regular expressions) to monoids that are not necessarily free. ==Definition== Let be a monoid. The set of rational subsets of is the smallest set that contains every finite set and is closed under * union: if then * product: if then * Kleene star if then where and . This means that any rational subset of can be obtained by taking a finite number of finite subsets of and applying the union, product and Kleene star operations a finite number of times. In general a rational subset of a monoid is not a submonoid. 抄文引用元・出典: フリー百科事典『 ウィキペディア(Wikipedia)』 ■ウィキペディアで「rational set」の詳細全文を読む スポンサード リンク
|